System and method for distributing packets in a network

ABSTRACT

A system and method for distributing packets in a network arc disclosed. The method comprises a step of receiving at least one data packet at a first node front a second node. The method also comprises a step of determining a current set of weights which are applied by the second node to distribute data packets across the first plurality of links. The received data packets are analysed to determine if the current set of weights are to be adjusted (step S 102 ). When it is determined that the current set of weights is to be adjusted, an adjusted set of weights is generated by determining an adjustment factor (step S 104 ). The adjustment factor is applied to the current weight for the selected link and at least one other current w eight in the current set of w eights.

TECHNICAL FIELD

The invention relates to a system and method of distributing datapackets through a network, in particular through a network having aplurality of links which can be aggregated, for example in a radionetwork.

BACKGROUND

In the context of computer networks, link aggregation is the practice ofcombining multiple links and presenting them as a single link to theoutside world. It allows for improvements in capacity and reliabilityversus what is achievable when a single non-aggregated link is used.

FIG. 1 illustrates a network in which link aggregation is used. There isa distributor 10 which is connected to a collector 12 by a plurality oflinks: link 0, link 1, . . . , link n. The distributor 10 receives datapackets and splits them amongst the various links, according to somebalancing mechanism. The collector 12 receives the packets from thevarious links, optionally re-orders the packets, and delivers them tothe next part of the network, e.g. upper layers of the network stack.

A clear quantification of the capacity and reliability improvementsassociated with link aggregation would depend on the mechanism employedand how it is configured. In simple terms, and as intuition wouldsuggest, the capacity of an aggregated link might be as high as the sumof the capacity of each of the individual links. Reliability is alsoincreased by virtue of the fact that we are no longer in a situationwhere a single link failure is enough to bring communications to a halt.An aggregated link composed of N simple links could potentially surviveN 1 simultaneous failures before communications are halted, albeit witha capacity penalty.

One challenge is to determine how packets are to be distributed amongstthe various links. Some instances of this problem have known solutions.For example, when the capacity of each link is known, the distributor 10can simply split traffic such that each link gets an amount of trafficthat is proportional to its share of the overall capacity. For example,given N links with capacities C={c₁, c₂, c₃ . . . c_(N)}, thedistributor 10 can simply split traffic such that each link gets anamount of traffic that is proportional to its share of the overallcapacity, i.e. link i would get

$\frac{c_{i}}{\sum\limits_{j = 1}^{N}\; c_{j}}$

or me overall traffic.

In another variation with a known solution, each link has a queue whoseoccupancy is known. The distributor 10 can then simply forward a givenpacket through the link whose queue occupancy is lowest.

As an example of another solution, US2011/0116443A1 describes an exampleof a radio network having a set of sending radio devices and a set ofreceiving devices. There is a load balancing radio device that receivesdata packets from an originating network and that labels the datapackets with sequence numbers. The labelled data packets are thendistributed among the sending data packets based on the relativecapacities and statuses of the sending radio device. US2017/0170981describes a method for increasing wireless communication throughput byadjusting a tunnel bandwidth weighting schema in response to a change inbandwidth capabilities. US2016/0261507 describes a method forcontrolling and managing a flow which classifies a flow management spaceinto a plurality of spaces and adjusts variably the flow managementspace due to a control traffic processing overhead. U.S. Pat. No.9,762,495 describes a method for adjusting network traffic balance amonga plurality of communication links by determining weights for each linkand associating a lower weight with a degraded link. US2002/0161925describes an agile network protocol for secure communications with aload balancer. Typically in the prior art documents, the capacity and/orlatency of each link is obtainable, e.g. in US2017/0170981 heartbeatpackets are generated to monitor tunnel performance.

The applicant has recognised the need for a method and system which candistribute packets when there is little or no information regarding eachlink, including its capacity, status and/or latency.

SUMMARY

According to the present invention there is provided an apparatus andmethod as set forth in the appended claims. Other features of theinvention will be apparent from the dependent claims, and thedescription which follows.

We thus describe a method of distributing data packets through a networkcomprising a plurality of nodes and a plurality of links connecting eachpair of nodes, the method comprising: receiving at least one data packetat a first node from a second node, wherein the first node is connectedto the second node via a first plurality of links, determining a currentset of weights which are applied by the second node to distribute datapackets across the first plurality of links, wherein the current set ofweights comprises a current weight for each link in the first pluralityof links; analysing the at least one data packet which is received atthe first node from the second node to determine if the current set ofweights are to be adjusted; and when it is determined that the currentset of weights is to be adjusted, generating an adjusted set of weightsby determining an adjustment factor to be applied to the current weightfor a selected link in the first plurality of links; and applying theadjustment factor to the current weight for the selected link and atleast one other current weight in the current set of weights.

The plurality of links may be termed an aggregated link and may bebi-directional, e.g. once the adjusted weights have been determined; themethod may further comprise sending the adjusted weights to the secondnode. These adjusted weights may then be used as described below to sendsubsequent data packet(s) from the second node to the first node. The atleast one data packet may be received and analysed at a collector at thefirst node and may be sent from a distributor at the first node. Theadjusted set of weights may be considered to be feedback because itspecifies how subsequent traffic is to be distributed across the links.In this way, the bi-directional nature of the aggregated link may beused to carry feedback from the first node to the second node (andvice-versa for the other direction).

Applying the adjustment factor may comprise one of: adding theadjustment factor to the current weight for the selected link toincrease the amount of traffic which is distributed across the selectedlink or subtracting the adjustment factor from the current weight forthe selected link to decrease the amount of traffic which is distributedacross the selected link. In other words, a positive adjustment factormay be applied to increase the amount of traffic and a negativeadjustment factor may be applied to decrease the amount of traffic on aparticular link.

For example, where there are N links, the current set of weights may bedefined as W_(A), with a weight w₁ for each of the N links:

W _(A) ={w ₁ ,w ₂ ,w ₃ . . . W _(N)}

and the adjusted set of weights may be defined as:

={ŵ ₁ ,ŵ ₂ ,ŵ ₃ . . . ŵ _(N)}

The adjustment factor may be applied to a plurality of weights in thecurrent set of weights so that the adjusted weight is adjusted inproportion to its current value. By adjusting the weights in proportionto their original values, it may be possible to converge on a solutionmore quickly. For example, when the adjustment factor is added to thecurrent weight for the selected link, the adjustment factor may beapplied to the plurality of weights to transfer more traffic from linkshaving higher weights and vice versa when the adjustment factor issubtracted from the current weight for the selected link, the adjustmentfactor may be applied to the plurality of weights to transfer moretraffic to links having higher weights. This may be expressed as:

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

where ŵ_(k) (a) is the adjusted weight for each link k, a is theadjustment factor, w_(k) is the current weight for each link k, and C isa constant value which represents the total of all weights, i.e.:

${\sum\limits_{i = 0}^{N}\; w_{i}} = C$

The ratio by which the adjustment factor is multiplied, i.e. thewj/(C-wi) ratio, may be calculated as the relative weight w_(j) of oneother link j in comparison to all the weights-except-the weight w_(i)for the selected link i. Using such a ratio is one way of changing theweights in proportion to their existing value whereby more traffic istransferred from links having higher weights to the selected link andvice versa.

Alternatively, the adjustment factor may be applied to only one otherweight in the current set of weights. The remaining weights in theadjusted set of weights may have the same value as the current set ofweights. In this way, traffic may be transferred between the selectedlink and its paired link. To balance the traffic load, when theadjustment factor is added to the current weight for the selected link,the adjustment factor is subtracted from the one other weight thustransferring the weight from paired link to the selected link and whenthe adjustment factor is subtracted from the current weight for theselected link, the adjustment factor is added to the one other weightthus transferring the weight to the paired link from the selected link.This may be expressed as:

${{\hat{w}}_{k}(a)} = \left\{ \begin{matrix}{{w_{k} + a},} & {{i = k}\mspace{95mu}} \\{{w_{k} - a},} & {{j = k}} \\{\mspace{40mu}{w_{k},}} & {i \neq {k\mspace{14mu}{or}\mspace{14mu} j} \neq k}\end{matrix} \right.$

where ŵ_(k) (a) is the set of adjusted weights, a is the adjustmentfactor and w_(k) is the current weight for each link k.

Determining the current set of weights may comprise reading the currentset of weights from a header attached to the at least one data packet,e.g. by piggy-backing on the data packet. In this way, there is no needto create new packets such as heartbeat packets to obtain informationabout the latency of a link or to monitor for packet loss as in theprior art, for example US2017/0170981. Where information on the link isnot available, e.g. because it is not possible to generate heartbeatpackets, the problem domain may be considered to be different from suchprior art documents where link information can be obtained or isavailable. The header may comprise additional information, includingsome or all of a set of per-link sequence numbers, a global sequencenumber, a previous link field and a timestamp. The set of per-linksequence numbers may comprise a sequence number s_(i) for each link iwhich is incremented each time a data packet is sent on link i. Theglobal sequence number may be a number which incremented each time adata packet is sent on any one of the plurality of links. The previouslink field may identify which link sent the previous packet. Thetimestamp may be the time at the second node when each data packet issent out. The header may be updated by the second node before sendingeach data packet.

Analysing the at least one data packet may comprise analysing one ormore logic blocks which may reside at the collector and which mayinclude packet-loss steering logic and loss-less steering logic. Thelossless steering logic may be applied before the packet-loss steeringlogic whereby balancing the distribution of packets, using losslesssteering logic, over the plurality of links may be achieved. Losslesssteering logic may be used to infer congestion from queue build-up, i.e.when a link is oversubscribed, the packet-queue on the transmitter sidestarts to grow. These longer queues lead to an increase in latency andthis may be detected by the lossless steering logic to updates theweights before any packet-loss occurs.

Analysing the at least one data packet may thus comprise usingpacket-loss steering logic and determining that the current set ofweights is to be adjusted when there has been packet loss. Such logicmay use packet-loss events to infer congestion on a given link and thustraffic may be steered away from such a link. That is to say, if a givenpacket, or group of packets, is lost on a given link, it can be inferredthat there is a high degree of probability that the link in question isoversubscribed, i.e. the queue is full. As such the packet-loss steeringlogic will direct traffic away from a link on which packet-loss has beendetected.

Analysis using packet-loss steering logic may be done by comparing aper-link sequence number for each of two data packets received on thesame link. For example, analysing the at least one data packet maycomprise: determining which link the at least one data packet wasreceived on, obtaining a first per-link sequence number for thedetermined link; storing the determined per-link sequence number;determining when a second data packet is received on the same link asthe determined link; obtaining a second per-link sequence number for thesecond data packet; and determining whether or not there is packet lossby comparing the first and second per-link sequence numbers. Comparingmay comprise determining the difference between the first and secondper-link sequence numbers and when the difference is less than apacket-loss threshold, e.g. one, it is determined that there is nopacket loss. When the difference is greater than the packet-lossthreshold, it may be determined that there has been packet-loss. Each ofthe per-link sequence numbers may be read from the header as describedabove. Thus in other words, packet-loss detection uses a per-linksequence number field that the distributor adds to each packet. Whenthere is packet loss, a negative adjustment factor may be applied in theequation above, for example:

a=−P _(pl) w _(i)

P _(ok)∈]0,1]

where P_(pl) may be termed a packet-loss penalty factor. The determiningand obtaining steps may then be repeated for subsequently received datapackets.

Analysing the at least one data packet may comprise analysing usinglossless steering logic and determining that the current set of weightsis to be adjusted when the latency of a link within the plurality oflinks is increasing. In other words, the loss-less steering logic maytrack a proxy for latency for each link and if latency increases it canbe inferred that the number of packets in the queue is progressivelyincreasing, a symptom of oversubscription. Lossless steering logic maybe timestamp based or global sequence based.

Such timestamp based lossless steering logic analysis may be done byusing a remote and a local timestamp for each of two data packetsreceived on the same link to calculate a latency difference valuewherein the remote timestamp represents the time at which each datapacket was sent, the local timestamp represents the time at which eachdata packet was received and the latency difference value isrepresentative of the latency on the link. For example, analysing the atleast one data packet may comprise: determining which link a first datapacket was received on, obtaining a first timestamp for the first datapacket, the first timestamp indicating the time at which the data packetwas sent from the second node; obtaining a second timestamp for thefirst data packet which indicates the time at which the first datapacket was received at the first node; determining when a second datapacket is received on the same link as the first data packet; obtaininga third timestamp for the second data packet, the third timestampindicating the time at which the second data packet was sent from thesecond node; obtaining a fourth timestamp for the second data packetwhich indicates the time at which the second data packet was received atthe first node; and calculating, using the first, second, third andfourth time stamps, a latency difference value which is representativeof the latency on the link on which the first and second data packet wasreceived.

Determining that the current set of weights are to be adjusted, mayinclude comparing the latency difference value to a latency growththreshold. When the latency difference value is greater than latencygrowth threshold, it may be determined that the weights are to beadjusted. Each of the first and third timestamps may be read from theheader as described above. The second and fourth timestamps may beobtained from a clock in the first node. When there is latency, anegative adjustment factor may be applied in the equation above, forexample:

a=−P _(lg) W _(i)

P _(lg)∈]0,1]

where P_(lg) may be termed a latency growth penalty factor.

The timestamps may be used to detect one-way latency increases. Thelatency difference value is representative of the latency but is notequal to the real latency. The latency difference value may be thelatency growth, i.e. the derivative of the latency. This is advantageousbecause it may be calculated using unidirectional traffic and withoutany sort of synchronization mechanism. For example, calculating thelatency difference value may comprise: calculating a first latency valueby subtracting the first timestamp from the second timestamp;calculating a second latency value by subtracting the third timestampfrom the fourth timestamp; and calculating the latency difference valueby subtracting the first latency value from the second latency value,i.e. by calculating:

λ_(i+1)−λ_(i).

where λ_(i+1) is the second latency value and is the first latencyvalue, and

λ_(i+1)=α_(i+1)−β_(i+1)

λ_(i)=α_(i)−β_(i)

where α_(i+1) is the fourth timestamp, β_(i+1) is the third timestamp,a, is the second timestamp, and β_(i) is the first timestamp.

Whether or not the weights are adjusted, the determining, calculatingand obtaining steps may then be repeated for subsequently received datapackets.

The method may further comprise storing a set of latency valuescomprising the most recently calculated latency value for each link.Similarly, the method may further comprise storing a set of latencydifference values comprising the most recently calculated latencydifference value for each link.

The timestamps may be optional and thus as an alternative, the losslesssteering logic may also use a global sequence number to determinewhether there is any latency. Such global sequence numbers instead maybe added to each packet before sending, e.g. by a distributor. Analysingusing such global sequence lossless steering logic may comprisecalculating a discrepancy growth value between a first pair of datapackets received within a threshold time on a pair of links and a secondpair of data packets received on the same pair of links within thethreshold time. Calculating the discrepancy growth value may comprisecalculating a first global sequence discrepancy value for the first pairof data packets; calculating a second global sequence discrepancy valuefor the second pair of data packets;

and calculating the discrepancy growth value by subtracting the firstglobal sequence discrepancy value from the second global sequencediscrepancy value. For example, the threshold time may be set so thatthe pair of packets are received in quick succession on links i and j.

The analysis, e.g. by the collector, may comprise looking at the globalsequence number of the packet received on each link and noting thedifference between the two numbers. If this difference increases overtime, it can be interred that one of the links is probablyoversubscribed, more specifically the link having the lower globalsequence number is probably oversubscribed and thus traffic is steeredaway. For example, analysing the at least one data packet may comprise:obtaining a first global sequence number for a first data packet in thefirst pair of data packets; obtaining a second global sequence numberfor a second data packet in the first pair of data packets; obtaining athird global sequence number for a first data packet in the second pairof data packets; obtaining a fourth global sequence number for a seconddata packet in the second pair of data packets; calculating, using thefirst, second, third and fourth global sequence numbers, a discrepancygrowth value which is representative of the latency on the links onwhich the first and second pairs of data packet were received.

For example, the first global sequence discrepancy value may becalculated by subtracting the first global sequence number from thesecond global sequence number; and the second global sequencediscrepancy value may be calculated by subtracting the third globalsequence number from the fourth global sequence number; and thediscrepancy growth value may be calculated by subtracting first globalsequence discrepancy value from the second global sequence discrepancyvalue, for example. by calculating:

Δ² g=Δ _(g1)−Δ_(g0)

where Δ²g is the discrepancy growth value, Δg₀ is the first globalsequence discrepancy value and Δg₁ is the first global sequencediscrepancy value and

Δg ₀ =g _(0j) −g _(0i)

Δg ₁ =g _(1j) −g _(1i)

Where g_(0i) is the first global sequence number, g_(0j) is the secondglobal sequence number, g_(1i) is the third global sequence number andg_(1j) is the fourth global sequence number.

In this example, obtaining the first and second global sequence numbersmay be in response to determining that the first pair of packets hasbeen received within the threshold time by determining that a differencebetween times of receipt for both the data packets in the first pair ofpackets is lower than the threshold time. Similarly, obtaining the thirdand fourth global sequence numbers may be in response to determiningthat the second pair of packets has been received within the thresholdtime by determining that a difference between times of receipt for boththe data packets in the second pair of packets is lower than thethreshold time. The global sequence numbers may be read from the headeron the received data packet.

In another example, the first global sequence discrepancy value may becalculated by subtracting the time of receipt of the second data packetin the first pair of packets from the time of receipt of the first datapacket in the first pair of packets; and the second global sequencediscrepancy value may be calculated by subtracting the time of receiptof the second data packet in the second pair of packets from the time ofreceipt of the first data packet in the second pair of packets. Thediscrepancy growth value may then be calculated by subtracting the firstglobal sequence discrepancy value from the second global sequencediscrepancy value, for example. by calculating:

A ² g=Δg ₁ −Δg ₀

where Δ²g is the discrepancy growth value, Δg₀ is the first globalsequence discrepancy value and Δg₁ is the first global sequencediscrepancy value and

λg ₀=α₀−β₀

Δg ₁=α₁−β₁

Where α₀ is the time of receipt of the first data packet in the firstpair of packets, β₀ is the time of receipt of the second data packet inthe first pair of packets, α₁ is the time of receipt of the first datapacket in the second pair of packets and β₀ is the time of receipt ofthe second data packet in the second pair of packets.

Obtaining the first and second global sequence numbers may be inresponse to determining that the second data packet in the first pair ofpackets was received with a flag indicating that the second data packetwas sent within the threshold time of the first data packet in the firstpair of packets. Similarly, obtaining the third and fourth globalsequence numbers may be in response to determining that the second datapacket in the second pair of packets has been received with a flagindicating that the second data packet was sent within the thresholdtime of the first data packet in the second pair of packets. When it isdetermined that the flag is present, the method may further compriseusing the first, second, third and fourth global sequence numbers toidentify the first and second pairs of data packets. For example, whenthe flag is present, the method may comprise obtaining the globalsequence number of the second data packet and identifying the first datapacket by, searching a store, e.g. a table, for a data packet having aglobal sequence number which is one less than the global sequence numberof the second data packet. Similarly, the method may comprise obtainingthe global sequence number of the fourth data packet and identifying thethird data packet by, searching a store, e.g. a table, for a data packethaving a global sequence number which is one less than the globalsequence number of the fourth data packet. The method may also comprisedetermining that the third and fourth data packets were sent on the samepair of links as the first and second data packets and rejecting them ifthey are not. Thus, in this way, the discrepancy growth value may becalculated, using the first, second, third and fourth global sequencenumbers.

In both examples, the times of receipt may be determined from a clock onthe node which receives the packets. The threshold time may be small toindicate that the pair of packets were received in quick succession. Thediscrepancy growth value may thus be representative of the latency onthe links on which the first and second pairs of data packets werereceived and may be calculated using the global sequence numbers of thedata packets.

Whether or not the weights are adjusted, the calculating and obtainingsteps may then be repeated for subsequently received pairs of datapackets on pairs of links. The method may further comprise storing a setof global sequence discrepancy values comprising the most recentlycalculated global sequence discrepancy value for each pair of links.Similarly, the method may comprise storing a set of discrepancy growthvalues comprising the most recently calculated discrepancy growth valuefor each pair of links. One of both of the set of global sequencediscrepancy values and the set of discrepancy growth values may bestored in a directed graph. The or each discrepancy growth value may beadjusted using a packet rate of the received data packets and theadjustment may take place before storing.

Determining whether the current set of weights are to be adjusted maycomprise comparing the discrepancy growth value to a discrepancythreshold. When a magnitude of the discrepancy growth value is greaterthan a magnitude of the discrepancy threshold, the method may compriseapplying a loss-less adjustment factor as the adjustment factor tochange the weights of the pair of links. For example, if the value ofthe growth is above the discrepancy threshold, traffic may be steeredaway from the second link towards the first link in the pair of links.If the growth is below the negative version of discrepancy threshold,traffic may be steered away from the first link and towards the secondlink. If the growth is close to zero, no action may be taken. In thisexample, the full weight adjusting mechanism may not be used becauseonly the weights associated with a pair of links i and j are changed.The adjusted set of weights may be defined as:

${{\hat{w}}_{k}(a)} = \left\{ \begin{matrix}{{w_{k} + a},} & {{i = k}\mspace{95mu}} \\{{w_{k} - a},} & {{j = k}} \\{\mspace{40mu}{w_{k},}} & {i \neq {k\mspace{14mu}{or}\mspace{14mu} j} \neq k}\end{matrix} \right.$

To steer traffic away from link j and towards link i, a may bedetermined by multiplying an adjustment factor P_(ia) (which may betermed a lossless-adjustment factor) against the original weighting forlink i, i.e.:

α=P _(ia) w _(i)

P _(la)∈]0,1]

Analysing the at least one data packet may comprise: determining when alink is not functioning properly within the network; and when it isdetermined that a link is not functioning, generating an adjusted set ofweights to adjust the weight of the non functioning link by theadjustment factor. Determining a link is not functioning may comprise:determining that the time which has elapsed between receipt of a pair ofpackets on the same link is higher than a threshold; in response to thisdetermining, monitoring for receipt of a packet on the same link withina countdown; and when no packet is received within the countdown,determining that the link is not functioning properly. In the formulaabove, the adjustment factor may be a negative adjustment factor a whichmay be the minimum of the current weight or the average weight, namely:

${a = {{- 1} \cdot {\min\left( {\frac{C}{N},w_{i}} \right)}}},$

Alternatively, the method may comprise determining a link is notfunctioning by: determining that a weight within the set of weights iszero; in response to this determining, starting a countdown; and oncethe countdown reaches zero, increasing the weight of the zero weightedlink in proportion to the lowest weight in the set of weights. In theformula above, the adjustment factor may be a negative adjustment factora defined by:

α=γ·min(W),

where γ is a constant.

Each of the analysis steps above may be carried out even though when thecapacity of each link is unknown, time-varying and/or potentiallyasymmetrical. Similarly, the analysis steps may be applied when latencyis unknown, time-varying and/or potentially asymmetrical. There may alsobe no knowledge of queue occupancy and/or up-down status. Such a set ofconstraints is common in packet-oriented networks and thus the methodsdescribed above are particularly useful.

We also describe a collector in a first node in a network comprising aplurality of nodes, wherein the collector is configured to carry out thesteps of the method described above.

We also describe a distributor in a second node in a network comprisinga plurality of nodes, the distributor comprising a processor which isconfigured to apply a current set of weights when sending at least onedata packet to the collector; receive an adjusted set of weights fromthe collector; and apply the adjusted set of weights when sendingsubsequent data packets to the collector. The processor may be furtherconfigured to add a header to a data packet before sending the datapacket, wherein the header comprises a plurality of header valuesincluding at least one of a global sequence number, a set of per-linksequence numbers, a previous link field and a timestamp. The processormay be further configured to reset each of the header values in a resetphase and subsequently update each of the header values when a datapacket is sent.

The link aggregation mechanism described above may be applied regardlessof the specific nature of the links. It may thus be applicable to thedomain of link aggregation on packetized networks, e.g. aggregation overdifferent wireless protocols (e.g. LTE and Wi-Fi; Wi-Fi______33 andWiGig), aggregation of multiple channels of the same wireless protocol(e.g. multiple Wi-Fi______33 connections), hybrid aggregation betweenwireless and wired (e.g. Wi-Fi+WiGig+Ethernet), link aggregation ofmultiple wired protocols (e.g. DOCSIS+ADSL; multiple ADSL connections;multiple Ethernet connections), and aggregation at the transport layerlevel. The distributors and collectors described above may reside in aradio controller and/or a remote terminal.

According to another aspect of the invention, there is also provided acomputer readable medium, i.e. any storage device that can store datawhich can be read by a computer system, for storing a computer programwhich when implemented on a computer system (including a distributorand/or a collector) causes the steps of the method above to beperformed. Examples of a computer readable medium include a hard-drive,read only memory, random access memory, a compact disc, CD-ROM, adigital versatile disk, a magnetic tape, other non-transitory devicesand other non-optical storage devices. The computer readable medium mayalso be distributed over a network coupled system so that the computerprogram code is stored and executed in a distributed fashion. Thecomputer readable medium is preferably non-transitory.

Although a few preferred embodiments of the present invention have beenshown and described, it will be appreciated by those skilled in the artthat various changes and modifications might be made without departingfrom the scope of the invention, as defined in the appended claims.

BRIEF DESCRIPTION OF DRAWINGS

For a better understanding of the invention, and to show how embodimentsof the same may be carried into effect, reference will now be made, byway of example only, to the accompanying diagrammatic drawings in which:

FIG. 1 is a schematic illustration of link aggregation within a network;

FIG. 2a is a schematic illustration of a network for link aggregationaccording to one embodiment;

FIG. 2b is a flowchart illustrating the steps carried out in the networkof FIG. 2 a;

FIG. 2c is a schematic illustration of a weight adjustment mechanism aspart of the method of FIG. 2 b;

FIG. 3a is an example header to be included in a packet being carriedthrough the network;

FIG. 3b is a flowchart illustrating the steps carried out by adistributor within the network of FIG. 2 a;

FIG. 4a is a schematic model of a link within the network of FIG. 2 a;

FIG. 4b is a flowchart of the steps carried out by the collector in oneexample of packet-loss steering logic

FIG. 5a is a flowchart of the steps carried out by the collector in oneexample of lossless steering logic;

FIG. 5b is a graph of clock reading against time;

FIG. 5c is an illustration of time delay between the distributor and thecollector;

FIG. 6a is a flowchart of the steps carried out by the collector in asecond example of lossless steering logic;

FIG. 6b is an illustration of two pairs of packets arriving in quicksuccession;

FIGS. 6c and 6d are graphs for storing information which may be used inthe method of FIG. 6 a;

FIG. 7a is an alternative header to be included in a packet beingcarried through the network;

FIG. 7b is a flowchart of the steps carried out by the collector in analternative portion of the method shown in FIG. 6 a;

FIG. 7c is an illustration of the timing of a pair of packets used inthe method of FIG. 7 b;

FIG. 8a is a flowchart of the steps carried out by the collector fordetermining whether there is a dead link;

FIG. 8b is an illustration of the timing of a pair of packets used inthe method of FIG. 8 a;

FIGS. 9a and 9b are schematic illustrations of the components within adistributor and a collector respectively; and

FIG. 9c is a schematic illustration of a system which may incorporatethe described distributors and collectors.

DETAILED DESCRIPTION OF DRAWINGS

FIG. 2a shows a computer network which incorporates link aggregationaccording to one embodiment. For simplicity, just a single pair of nodes20, 30 is shown but it will be appreciated that the network may comprisemany more such nodes. Each of these nodes may be located in differentphysical locations and may thus be termed as remote from one another.The first node 20 (labelled node A) comprises a first distributor 22 anda first collector 24. The second node 20 (labelled node B) comprises asecond distributor 32 and a second collector 34. The first distributor22 may be considered local to the first collector 24, i.e. they arelocated in the same location, but may be considered remote to the secondcollector 34. Similarly, the second distributor 32 may be consideredlocal to the second collector 34, but may be considered remote from thefirst collector 24.

The nodes 20, 30 are connected via a bi-directional link to allow bothnodes to send and receive packets. The bi-directional link comprises afirst plurality of links from the distributor 22 in the first node 20 tothe collector 34 in the second node 30 and a second plurality of linksfrom the distributor 32 in the second node 30 to the collector 24 in thefirst node 30. The first and second plurality of links may have the samenumber of links. When a node is transmitting packets, it may be termed atransmitting end because it transmits packets to the other node whichreceives the packets and which may thus be termed a receiving end. Thepresence of bi-directional traffic is useful because it also allowsfeedback to be carried from the receiving end to the transmitting end,i.e. from the collector of node B to the distributor of node A, andlikewise, from the collector of node A to the distributor of node B.

FIG. 2b is a flowchart of the communication between nodes A and B whennode A is transmitting packets to node B. The first step S100 is for thedistributor 22 of node A to send packets to the collector 34 of node B.The packets are distributed across the first plurality of linksaccording to a set of weights W_(A), with an entry IN, for each of the Nlinks:

W _(A) ={w ₁ ,w ₂ ,w ₃ . . . w _(N)}

Similarly, there is also an independent set of weights W_(B) for thesecond plurality of links with an entry w_(i) for each of the M linkswhere M may the equal to or different from N:

W _(B) ={w ₁ ,w ₂ ,w ₃ . . . w _(M)}

The weights specify how traffic should be split across the variouslinks. The weights sum to a constant value C_(A) or C_(B), i.e.:

${{\sum\limits_{i = 0}^{N}\; w_{i}} = C_{A}};{{\sum\limits_{i = 0}^{M}\; w_{i}} = C_{B}}$

As an example, there may be four weights and C_(A) and C_(B) may equal255. However, the constant values may be different for each node so thatC_(A) and C_(B) are not equal. The constant value does not change overtime and thus the set of weights W_(A) will always sum to C_(A). If thetraffic on a given link i is defined by t, and the total traffic fornode A is T_(A); the distributor is configured to route packets to thevarious links, such that:

$t_{i} = {\frac{w_{i}}{C}T_{A}}$

The initial or default set of weights may evenly distribute trafficacross each link. Thus:

${\forall i},{w_{i} = \frac{C}{N}}$

Once the incoming traffic is received by the collector 34 of node B itis analysed in step S102. The analysis includes at least one ofpacket-loss steering logic, lossless steering logic, and a dead-linkdetection mechanism which are described below in more detail. Theanalysis allows an adjusted set of weights Ŵ_(A) to be determined atstep S104. The logic and mechanisms residing in the collector adjustweights by applying an adjustment factor a, to steer traffic away, ortowards, a given link. For each link i, a positive adjustment factorimplies transferring more weight to link i, conversely, a negativeadjustment factor implies removing weight from link i, andre-distributing it amongst the other links. The adjusted set of weightsmay be defined as:

={ŵ ₁ ,ŵ ₂ , . . . ŵ _(N)} where

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

In the equation above, there is an assumption that there is at least onenon-dead link besides link i. If this is not the case, then the weightadjusting mechanism will take no action, because there are no links totransfer weight to.

FIG. 2c illustrates an example of the implementation of the equationabove. Intuitively, the equation above works as follows: it removes acertain amount of weight, a, from link i, and re-distributes this weightamongst the other links in proportion to their original weight. As shownin FIG. 2c , when re-distributing, the equation above will not transferany weight to dead links, i.e. links with a weight of zero such as link2, the method for resurrecting dead links is described later. In thisexample, three blocks of weight are illustrated as being transferredaway from link 0, but the mechanism would work in a similar way ifweight was being transferred to link 0, only the direction of the arrowswould change.

As illustrated, the weight distribution mechanism, when transferringweight away from a given link i, or when putting more weight on givenlink i, satisfies the following property: each of the remaining links j,with j≠i, sees its relative weight change by factor that is, in absoluteterms, increasing with w₁. In more informal terms, links with higherweights see a larger change vis-à-vis links with lower weights. In theexample of FIG. 2c , link 3 has an existing weight which is twice aslarge as that for link 1. Accordingly, when adjusting the weights, link3 receives twice as much of the weight being transferred away from link0.

Adjusting the weights using this proportionality may result more quicklyin convergence on a solution where the calculated weights are(proportionally) a good estimate for the capacity of each link and thusthere is minimal or no packet loss and latency within the system. Ifequal amounts were transferred to each of links 1 and 3, it would benecessary to transfer smaller amounts to ensure that the capacity of thelinks is not exceeded and thus convergence is likely to take longer.

The equation above satisfies the property of changing the weights inproportion to the existing value for the weight but a skilled personwill appreciate that there are many other ways to satisfy it. Forexample, at least to a first approximation, any link aggregationmechanism that distributes weights in such a way as to satisfy theproperty is contemplated, even if the property is not always satisfied,but satisfied with a high degree of probability.

Returning to FIG. 2b , the collector 34 will then forward the adjustedset of weights Ŵ_(A) to its local distributor 32 within the same localnode (Step S106) so that the distributor 32 can send the adjusted set ofweights Ŵ_(A) to the collector in the remote node A (step S108). Theadjusted set of weights Ŵ_(A) could be piggy-backed into outgoingpackets.

The collector 24 on node A receives the adjusted set of weights Ŵ_(A)and then forwards it to the distributor 22 of node A (step S110). Beforeforwarding the adjusted set of weights Ŵ_(A), the collector 24 may checkwhether or not the last transmission from the distributor 32 of theremote node B was received within a predetermined time range. If notransmissions have been received within the predetermined time range,the collector 24 may reset to the original set of weights W_(A) e.g.where

${\forall i},{w_{i} = {\frac{C}{N}.}}$

To determine whether the weights were received within the predeterminedtime range, the collector may keep a countdown timer D which mayinitially be inactive but once activated, it counts to zero, at whichtime the default set of weights is sent on.

When a packet arrives, if the timer is inactive—either because this isthe first packet, or because it has fired before the collector will lookinto the feedback portion of the link aggregation header, extract theset of weights it has just received, Ŵ, and forward them to the adjacentdistributor. From the same packet, it will also extract the globalsequence number, and store it locally as g. Finally, the collector willinitiate the timer with the predetermined time range which may be termedweight-update-countdown and merely as an example 40 ms is a reasonablevalue for this countdown.

The collector may also check that weight updates are fresh (i.e. thatthe adjusted set of weights Ŵ_(A) really are the most up-to-datefeedback information available); and not simply a set of weights thatarrived through a link with a higher latency. This may be done when apacket arrives, and the timer is active. In this instance, the collectorwill compare the global sequence number stored as g, with the globalsequence number it has just received. If the global sequence number ithas just received is older than locally stored g, the collector willtake no action regarding weight forwarding, as the new feedback isout-of-date. On the other hand, if the global sequence number justreceived is more recent than the global sequence number stored locally,then there is a fresh set of weights and as such the collector willforward the weights it has just received to the adjacent distributor,update the locally stored global sequence number g, and restart thecountdown with a value of weight-update-countdown.

The collector 22 will then use the updated set of weights Ŵ_(A) whendistributing subsequent packets (step S112) and steps S102 to S110 arethen repeated to generate a subsequent updated set of weights.

It will be appreciated that the mirror-image method can be used toupdate the set of weights W_(B) used by the distributor 32 of node B.The method can also be replicated across pairs of nodes in a network ofmultiple nodes.

Distributor

Before sending a packet, the distributor may be configured to piggy-backsome extra data onto the packet. The exact place where this data isinserted will depend on the nature of the underlying layer. In oneexample illustrated in FIG. 3a , this data is simply prepended as anextra header. This header may include a per-link sequence number 40, aglobal sequence number 42, a previous link field 44, a timestamp 46(where this is available as explained in more detail below), and theweights 48 that the other distributor should use (e.g. as described inrelation to step S108). As an example, the field which includes theweights may use 1 byte per weight.

Each distributor has a set of per-link sequence numbers S={s_(i), s₂, s₃. . . s_(N)), one for each link. The per-link sequence number s_(i) foreach link i is a sequence number that is incremented by one whenever apacket is sent through a link. The global sequence number is a sequencenumber that is incremented by one whenever a packet is sent on any link.Thus, the global sequence number tracks how many packets have been sentwhereas the per-link sequence number tracks how many times each link hasbeen used. As explained below, the per-link sequence number may be usedby packet-loss steering logic at the collector end to detect packet lossevents on a given link. The global sequence number may be used by there-order mechanism, and, in some embodiments, by the lossless steeringlogic as well.

The number of bits used for the per-link sequence number may be low,potentially just one bit but more typically three bits, whereas morebits, typically eighteen, are used for the global sequence number.Deciding on the number of bits is important because there is a trade-offbetween false negatives and header size. For example, for the per-linksequence number, if two bits are used and four packets are lost, theper-link sequence number will cycle the per-link sequence number and thepacket-loss steering logic will not consider this to be a packet-lossevent which thus results in a false positive. A reasonable trade-off isrepresented by three bits. For the global sequence number, deciding onthe number of bits is not trivial and factors such as the maximum packetrate, the maximum delay and the time-window within which compared globalsequence numbers are received need to be taken into account because itis important to ensure that the logic surrounding global sequencenumbers correctly handles integer overflow.

The previous link field 44 identifies which link sent the previouspacket and as explained below is used by the dead link detectionmechanism. As an example, two bits of information may be used for thisfield. In some embodiments, the distributor will add a timestamp 46 toeach of the packets that are sent. More specifically, the distributorwill have a local clock, C_(dist), and when a packet is sent, thepresent value of this clock will constitute the timestamp. This field isoptional, but if there are enough resources to carry the timestamp itcan improve the decision-making capabilities of the lossless steeringlogic. As an example, twenty bits of information may be used for thisfield and the values may be expressed in microseconds.

FIG. 3b shows the steps which may be carried out at the distributor toinclude this additional information. At the start of the process, e.g.at the start of the day, there is a reset phase in which some or all theadditional information which is inserted by the distributor is reset todefault values. The per-link sequence number for each sequence is set toa base value, e.g. zero (S200) and the global sequence number is set toa base value, e.g. zero (S202). The previous link field is set to a basevalue to indicate that no previous packet has been sent (S204). Where atimestamp is being used, the clock may be set to a base value, e.g. zero(S206). It is noted that the logic described below does not requirefrequency precision requirements and thus it is possible to dispensewith synchronization mechanisms for the clock. The weights are alsoreset to the default values, e.g.

${W_{R} = \left\{ {w_{1},w_{2},{w_{3}\mspace{14mu}\ldots\mspace{14mu} w_{N}}} \right\}},{{{with}\mspace{14mu} w_{i}} = {\frac{C}{N}{\forall i}}}$

W_(R) indicates that these are not the weights being used by thisdistributor but are being used by another, i.e. remote, distributor. Forexample, the distributor 34 of node B sends the weights for thedistributor 24 of node A or vice versa. These default values persistuntil the local collector, i.e. collector 32 for the distributor 34,produces an updated set of weights as explained above. These defaultvalues are stored locally in the distributor. These reset steps arelisted in a particular order but it will be appreciated that they can becarried out simultaneously or in a different order.

The next step is to send a packet through a link with the default valuesappended (S210). Thus, when a packet is sent through link i, theper-link sequence number s_(i)=0 will go with the packet. Similarly, theglobal sequence number of zero will also be sent. The previous linkfield will include a base value which indicates that no other messageshave been sent. The present value of the clock may optionally beincluded as the timestamp. The default values of the weights for theremote distributor, i.e. the distributor which is local to the collectorwhich receives the packet, are also included. The distributor alsoincrements the per-link sequence number, i.e. s_(i)=1, and the globalsequence number (S212). The updated per-link sequence number and theglobal sequence number are stored locally on the distributor togetherwith a record tracking that the packet was sent over link i (S214).

The next packet is then sent by the distributor through the same or adifferent link (S216). The updated information is appended to thepacket. As an example, if the packet is sent through link j, theper-link sequence number s_(j)=0 will go with the packet and if thepacket is sent again through link i, the per-link sequence numbers_(i)=1 will be sent. The updated global sequence number of one willalso be sent. The previous link field will include a value whichindicates that the previous packet was sent on link i. The new andpresent value of the clock may optionally be included as the timestamp.The weights for the remote distributor are also included and these willbe the default weights unless they have already been updated asexplained above.

As indicated by the arrow, the next step is to return to the updating ofthe per-link sequence number and the global sequence number (S212). Forexample, if the packet is sent through link j, the per-link sequencenumber is updated to s_(j)=1 and if the packet is sent again throughlink i, the per-link sequence number is updated to s_(i)=2. The updatedglobal sequence number may be two. The updates are stored with the newidentifier for the previous link field. It will thus be appreciated thatthe process is an iterative one and the sending, updating and storingsteps are repeated as often as necessary.

If the time between the sending of two packets is more than apredetermined threshold termed a recent-thresh threshold, the identifierfor the previous link field may be reset to the base value to indicatethat no previous packet has been sent as described in S204. The value ofthe recent-thresh threshold may be configurable but as an example mayalso be set to 0.5 ms (e.g. as a default value).

As set out above, the analysis at the collector to determine an adjustedset of weights Ŵ_(A) includes at least one of packet-loss steering logicand lossless steering logic. FIG. 4a illustrates a model which may beused for each link. As shown each link may be modelled as a queuefollowed by a “wire” that adds a quasi-fixed delay, which is to say, adelay that can be said to be constant for short enough periods of time.When a packet is sent across the link, it will first go into the queue.If the queue is full the packet will be dropped, otherwise if there isspace in queue, the packet will be stored waiting its turn on the wire.The queue will empty at rate determined by the link capacity. Once apacket reaches the wire, it will take a quasi-fixed amount of time toreach the end.

The packet-loss steering logic uses packet-loss events to infercongestion on a given link. That is to say, if a given packet, or groupof packets, is lost on a given link, it is inferred that there is a highdegree of probability that the link in question is oversubscribed, i.e.the queue is full. In such a circumstance, the packet-loss steeringlogic aims to direct traffic away from a link on which packet-loss hasbeen detected.

As explained in more detail below the lossless steering logic tracks aproxy for latency for each link. If latency increases, it is inferredthat the number of packets in the queue is progressively increasing.This may be a symptom of oversubscription and thus the lossless steeringlogic aims to direct traffic away from a link on which a latencyincrease has been detected. Ideally the lossless steering logic willkick-in before packet-loss steering logic, and lossless balancing acrossthe multiple links will be achieved.

Packet Loss Steering Logic

FIG. 4b illustrates the steps which may be carried out by the collectorto implement the packet-loss steering logic. FIG. 4b illustrates thestep in relation to a single link i but it will be appreciated that thisis repeated for all links by the collector keeping track of the lastper-link sequence number received on each link, S={s₁, s₂, s₃ . . .s_(N)}. Initially the collector receives a packet on link i (step S400).The collector determines and stores the per-link sequence number s_(i)for link i (step S402). When a new packet arrives on link i (step S404),the collector determines the per-link sequence number of the new packet(step S406) and then determines whether the per-link sequence number ofthe packet which has just been received is equal to s_(i)+1 (step S408).If there is a match, then the packet-loss steering logic will take noaction besides returning to step S402 to track (i.e. storing) the newvalue s_(new) as the per-link sequence number s_(i). The method can thenbe reiterated.

On the other hand, if they differ, at least one packet has been lost,and traffic may then be steered away from that link using the weightadjusting mechanism outlined above. Thus the adjusted set of weights maybe defined using the equation above, namely:

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

where a is a negative adjustment and may be determined by multiplying anadjustment factor P_(pl) (which may be termed a packet-loss-penaltyfactor) against the original weighting, i.e.:

a=−P _(pl) w _(i)

P _(pl)∈]0,1]

For example, a suitable value is 0.05.

Once the weights have been adjusted, the method repeats the steps S402to S408. A more complex embodiment of the invention may use a PIDcontroller at this stage.

Timestamp Based Lossless Steering Logic

FIGS. 5a to 5c illustrate a first method which may be carried out by thecollector to implement the lossless steering logic. In this method,timestamps are present on the aggregation header. In an optional resetstep illustrated in FIG. 5a , the local clock counter, C_(col) (wherethe subscript “col” stands for “Collector”) is reset to zero. As was thecase with the distributor clock C_(dist), there are no strongrequirements pertaining to frequency or phase. This clock may start witha value with zero, and does not require any extra frequencysynchronization mechanisms.

FIG. 5b illustrates the relationship between the clock readings overtime for the far-end (remote) distributor clock, and local collectorclock, C_(dist) and C_(col). These clocks might have started atdifferent times, and each end does not know what the reading of theother at is given instant in time. However, if they are running at asimilar frequency, or are off by a multiplicative factor that can becorrected for, then we have that, for the short-to-medium term,C_(col)−C_(dist)=k. Which is to say, at a given instant, the clockreadings, will differ by a constant amount k. It is noted that systemswith stringent synchronization requirements would not be able to makethis assumption, and would have to employ some sort of synchronizationmechanism.

Returning to FIG. 5a , the next step S502 is to receive a packet i atthe collector from the remote distributor on link i. As explained abovewhen a given packet i leaves the distributor, the distributor determinesthat the time on the clock at the distributor C_(dist) reads β_(i), andthus packet i's timestamp will be β_(i). This value for the timestamp isread by the collector (step S504). When a packet is received, thecollector reads the time on the collector clock, C_(col), which has areading of a, (step S506). It is noted that steps S502 to S506 are shownas sequential steps but it will be appreciated that they may be carriedout together or in a different order.

As illustrated in FIG. 5c , the sending of the packet over link i addsan unknown delay δ_(i). It is also not known what the clock readingγ_(i) would be on the collector clock for the time at which the packetwas sent. Thus the clock reading a, on the collector clock at the timeof receipt of the message may be expressed in terms of the two unknowns:

α_(i)=γ_(i)+δ_(i).

However, it is known that γ_(i) and β_(i) pertain to the same moment intime and that, as shown in FIG. 5b , there is a constant difference of kbetween the two readings, i.e. that γ_(i)−β_(i)=k. Accordingly,combining these equations leads to:

α_(i)−β_(i)=γ_(i)+δ_(i)−β_(i) =k+δ _(i)

Returning to FIG. 5a , the next step is to calculate α_(i)−β_(i) asλ_(i), which is equal to the latency of packet i plus a constant. We areable to calculate λ_(i), as both α_(i) and β_(i) are known at this point(note that k and are still unknowns). As shown at step S510,subsequently, a second packet is received on the same link and thetimestamp β_(i+1) on the packet and the time α_(i+1) on the collectorclock are read as at steps S504 and S506. The updated value for λ isthen calculated:

λ_(i+1)=α_(i+1)−β_(i+1)

The two values for λ can be expressed in terms of two unknowns k andδ_(i), i.e. λ_(i+1)=k+δ_(i+1) and λ_(i)=k+δ_(i). The difference betweenthe two values for λ is thus equivalent to the difference between thetwo values for the unknown latency, i.e.

λ_(i+1)−λ_(i) =k+δ _(i+1) −k−δ _(i)=δ_(i+1)−δ_(i)

That is to say, from λ_(i+1) and λ_(i) we are able to determine thelatency difference {dot over (δ)}=δ_(i+1)−δ_(i), i.e. the derivative ofthe latency (step S514). A growing latency on a given link suggests thatthe link's queue is filling up, a symptom of oversubscription.

The next step is to compare the latency difference with a thresholdwhich may be termed a latency-growth-threshold. This threshold may beconfigurable but a suitable example value is 0.4 ms. If the value isbelow the threshold, then the logic will take no action besidesreturning to step S510 to reiterate the method when a subsequent packetis received.

On the other hand, if the current value is above thelatency-growth-threshold, traffic may then be steered way from that linkusing the weight adjusting mechanism outlined above. Thus the adjustedset of weights may be defined as:

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

where a is a negative adjustment and may be determined by multiplying anadjustment factor P_(lg) (which may be termed a latency-growth-penaltyfactor) against the original weighting, i.e.:

α=−P _(lg) w _(i)

P _(lg)∈]0,1]

For example, a suitable value is 0.01.

Once the weights have been adjusted, the method returns to step S510 toawait a subsequent packet. A more complex embodiment of the inventionmay use a PID controller at this stage.

It will be appreciated that this method is just detailed for a singlelink but applies to all links. The collector may thus keep a set, Λ={π₁,λ₂, . . . λ_(N)}, with the last λ calculated for each link i.Additionally, the collector may keep a second set {dot over (Δ)}={{dotover (δ)}₁, {dot over (δ)}₂, . . . , {dot over (δ)}_(N)} tracking anexponential moving average of the latency difference.

Global Sequence Based Lossless Steering Logic

FIGS. 6a to 6d illustrate a second method which may be carried out bythe collector to implement the lossless steering logic. In this method,timestamps are not present on the aggregation header and the globalsequence number is used as detailed below.

FIG. 6a shows that the first step S600 is to identify a pair of packetswhich have been received in quick succession on a pair of links, namelylink i and link j. The exact nature of quick succession will depend onthe application but as an example, the pair of packets should bereceived within a threshold value, e.g. 0.01 ms, of one another. It willbe appreciated that this number is merely illustrative. An example ofsuch a pair of packets is shown in FIG. 6b . The packet on link iarrives with a global sequence number of g, and the packet on link jarrives with a global sequence number of g_(j). These numbers are readby the collector and the next step S602 is to determine the globalsequence number discrepancy Δg which is the difference between those twoglobal sequence numbers, i.e.

Δg=g _(j) −g _(i),

It is noted that if Δg>0 the latency associated with link i is probablylarger than the latency associated with link j (e.g. as would be thecase if g_(i)=100 and g_(j)=140, since the packet with a global sequencenumber of 140 was sent after the packet with a global sequence number of100, and yet both arrived almost at the same time). If Δg<0, the reverseis true (Δg=0 never occurs, as global sequence numbers are unique forshort enough periods of time, that is to say, before integer overflowoccurs).

The global sequence number discrepancy is proportional to the latencydiscrepancy. However, although the latency discrepancy is one of thefactors that accounts for a given global sequence discrepancy, a secondmajor factor influencing this value is packet rate, i.e. the number ofpackets-per-unit of time that is being sent. For example, consider twopackets i and j, received in quick succession, with g_(i)=100 andg_(j)=140 at given aggregated packet rate r₀. Now suppose that latencyremains the same but packet rate doubles, r₁=2 r₀. This this will causeglobal sequence numbers to increase at twice the rate and thus for thesame latency discrepancy we would now have g_(i)=100 and g_(j)=180.Accordingly, an optional step is to calculate the adjusted globalsequence number Δg which has been adjusted for packet rate r(t), i.e.

${\Delta\;\overset{\_}{g}} = \frac{g_{j} - g_{i}}{r(t)}$

It is noted that the nominator's unit is ‘packets’, whilst the unit ofthe denominator is ‘packets-per-second’. Accordingly, the unit of Δg isseconds, which means that Δg is no longer a measure proportional to thelatency difference (as was the case with Δg) but the latency differenceitself (or at least an estimate of it), as such we will call Δg thelatency discrepancy.

If the pair of packets is the first pair of packets which have beenreceived on this particular pair of links, there is an optional stepS606 of calculating an estimated latency discrepancy for this pair oflinks. One method of calculating such an estimated latency discrepancyrelies on the assumption that the latency discrepancy between thevarious links is fixed and uses the knowledge of the latency discrepancybetween other links. For example, if the latency discrepancy betweenlinks i and k is 0.5 miliseconds, and the latency discrepancy betweenlinks k and j is 1.3 milliseconds, it can be inferred that the estimatedlatency discrepancy between links i and j is 1.8 milliseconds. Theestimated latency discrepancy can be used with the latency discrepancycalculated based on the global sequence numbers to determine thediscrepancy growth as explained below in relation to step S614.

If the pair of packets are the first pair of packets which have beenreceived on this particular pair of links, the method may also continueas shown at step S608 by identifying a second pair of packets, also inquick succession, on the same set of links i and j. Such a second pairof packets is shown in FIG. 6b . As before, the global sequence numbersof each packet are read by the collector and the next step S610 is todetermine a subsequent global sequence number discrepancy Δg₁. Thisglobal sequence number discrepancy may be optionally adjusted at stepS612 to give the latency discrepancy Δg ₁ as explained with reference tostep S604.

The previous global sequence number discrepancy may be denoted as Δg₀and the adjusted global sequence number discrepancy (i.e. latencydiscrepancy) as Δg ₀. As illustrated at step S614, the values from thetwo pairs can be used to measure the discrepancy growth Δ²g bycalculating:

Δ² g=Δg ₁ −Δg ₀

Similarly, the adjusted discrepancy growth (also termed the latencydiscrepancy growth) may be calculated from:

Δ² g _(1,0) =Δg ₁ −Δg ₀

The global sequence discrepancy Δg may be considered to be aninclination between the two links, and the discrepancy growth, Δ²g, tobe the growth rate of this inclination. Assuming for now that packetrate is constant, a positive value of the discrepancy growth, i.e.Δ²g>0, arises in one of the following situations:

Latency over link i increased, but the latency over link j increasedmore.

Latency over link i is stable, whilst the latency over link j increased.

Latency over link i decreased, whilst the latency over link j increased.

Latency over link i decreased, whilst the latency over link j remainedstable.

Latency over link i decreased, whilst the latency over link j decreasedby a smaller amount.

In all the scenarios listed above a better set of weights steers sometraffic away from link j and towards link i.

At step S616, the growth is compared to a threshold known as thediscrepancy-threshold threshold. If the value of the growth is above thediscrepancy-threshold threshold, traffic is steered away from link jtowards link i (step S618). If the growth is below the negative versionof discrepancy-threshold threshold, traffic is steered away from link iand towards j. If the growth is close to zero, i.e. between the rangedefined from -discrepancy-thresh to discrepancy-thresh, no action istaken. The discrepancy threshold can be configurable but an examplevalue is a default 0.2 ms.

In this example, the full weight adjusting mechanism is not used becauseonly the weights associated with links i and j are changed. The adjustedset of weights may be defined as:

${{\hat{w}}_{k}(a)} = \left\{ \begin{matrix}{{w_{k} + a},{i = k}} \\{{w_{k} - a},{j = k}} \\{w_{k},{otherwise}}\end{matrix} \right.$

To steer traffic away from link j and towards link i, a may bedetermined by multiplying an adjustment factor P_(ia) (which may betermed a lossless-adjustment factor) against the original weighting forlink i, i.e.:

a=P _(la) w _(i)

P _(la)∈]0,1]

For example, a suitable value is 0.02.

The update formula may be rewritten as below:

$\left\{ {\begin{matrix}{{\hat{w}}_{i} = {w_{i} + {P_{la} \cdot w_{i}}}} \\{{\hat{w}}_{j} = {w_{j} - {P_{la} \cdot w_{i}}}}\end{matrix}\quad} \right.$

Similarly, to transfer weight from link i and towards link j the updateformula may be rewritten as below:

$\left\{ {\begin{matrix}{{\hat{w}}_{i} = {w_{i} - {P_{la} \cdot w_{j}}}} \\{{\hat{w}}_{j} = {w_{j} + {P_{la} \cdot w_{j}}}}\end{matrix}\quad} \right.$

A more complex embodiment of our invention would use a PID controller atthis stage.

FIG. 6a shows the detail of the method for two links but it will beappreciated that this method may apply to all the links. Accordingly,the collector needs to store values for the (adjusted) global sequencediscrepancy and the (adjusted) discrepancy growth for each pair oflinks. The collector may store this information in a pair of directedgraphs, Q and P, examples of which are shown in FIGS. 6c and 6d . Ineach graph, there will be a vertex for each link. When two packets arereceived in quick succession, on links i and j, the collector calculatesthe latency discrepancy, Δg. It will then check the graph in FIG. 6c tosee whether there is already an edge in the graph Q connecting i to j.If there is no edge, the collector will add two new edges to graph Q:one from i to j with a value of Δg _(new), and another from j to i, witha value of −Δg _(new).

If an edge between i and j is already present in graph Qin FIG. 6c witha value of Δg _(prev), the collector calculates the latency discrepancygrowth, Δ² g _(new)=Δg _(new)−Δg _(prev). After the latency discrepancygrowth is calculated, the values of Δg _(new), is also updated on graphQ. On graph P in FIG. 6d the collector stores, on each of the graph'sedges, an updated value of Δ² g. For both graphs, the updated value maysimply be the new value or alternatively the stored updated value may bean exponential moving average calculated for example using:

${\Delta^{2}{\overset{\_}{g}}_{new}} = \frac{{{\alpha\Delta}^{2}{\overset{\_}{g}}_{prev}} + {\Delta^{2}{\overset{\_}{g}}_{new}}}{\left( {1 - \alpha} \right)}$

An exponential moving average may smooth out the changing values but itwill be appreciated that this is just one option. The latencydiscrepancy growth we have just calculated, Δ² g _(new), is incorporatedinto the exponential moving average of the edge that connects i to j.For the edge on the opposite direction, from j to i, there is a negativeversion of the average.

The graphs allow a generalization of the step S606 in FIG. 6a ofestimating the latency discrepancy between links i and j, Δg _(est),provided there is a path of existing measurements between i and j. For agraph where the edges correspond to latency discrepancies, the followingproperty holds: for any cycle, the sum of the edges is equal to zero. Tosee why this is so, imagine that latency discrepancies between links areakin to height differences, if one imagines someone walking around apath that starts and ends at the same place; it is not hard to see thatthe sum of all the height differences on that path must be equal tozero.

The number of possible link pairs grows quadratically with the number oflinks, more specifically, for a link aggregation instance with N linkswe have

$\frac{N \cdot \left( {N - 1} \right)}{2}$

link pairs. This means that the method used to produce the estimatesbecomes considerably more relevant when the number of links increases(e.g. for a system with 20 links we have 190 link pairs). The techniquemay also be applied not only when a given measurement is missing, butalso when a measurement is present, but considered outdated.

FIGS. 7a to 7c illustrate a second, more accurate, but also more complexmethod to measure latency discrepancies between links. This methodinvolves a slight change to the distributor and some additional logic inthe collector. FIG. 7a is an illustration of the modified linkaggregation header which is needed for this method. As shown, the headerincludes the features as described above but also needs an extra flag140 which may be termed “quasi-simultaneous-transmission”. This flag 140indicates whether the previous packet was sent a negligible amount oftime before, if not simultaneously, and is added by the distributor whensending the packet.

FIG. 7b shows the steps carried out by the collector. A packet isreceived on link i in a first step S700. The collector then entersinformation into a table which is stored in memory on the collectorS702. The table comprises information from the link aggregation headerin the received packet, in particular the global sequence number and thevalue of the “quasi-simultaneous-transmission” flag. The collector alsoenters the number of the link on which the packet was received and thelocal clock reading at reception time.

The collector then determines if the “quasi-simultaneous-transmission”flag is set on the current packet (step S704). If the flag is not set,the collector returns to the beginning of the process. If the flag isset, the collector determines whether there is information relating tothe previous packet in the table by determining whether or not there isa global sequence number in the table which is a single decrease fromthe global sequence number associated with the packet we have justreceived. If the global sequence number is not present, the collectorreturns to the beginning of the process. If the global sequence numberis not present the collector determines whether the packet with thatnumber was received on the same link by checking the number of the linkin the table. If the link is the same, the collector returns to thebeginning of the process to await the next packet. If the links aredifferent the latency difference between the two links is calculated.

FIG. 7c illustrates an example of two packets. The packet received onlink j has an associated local clock reading of β, and the previouspacket had a reception time of α, and was received on link i. Since bothpackets were sent almost simultaneously, we can infer that the latencydifference Δg can be calculated as:

Δ g _(i,j) =α−β

The process can then be repeated for subsequent received packets tocalculate additional latency differences for additional pairs of links.Additional latency differences may also be calculated by identifyingwhether the next packet is present in the table, i.e. a packet whoseglobal sequence number is a single increment to the global sequencenumber associated with the packet we have just received. If this packetis present, and the “quasi-simultaneous-transmission” flag is set, thesteps of S706 to S710 may be repeated for a different packet.

The latency difference(s) calculated above may be considered a moreaccurate version of the latency discrepancy Δg than the one calculatedusing the steps of FIG. 6a . As it will be appreciated, a pair oflatency differences for the same pair of links can be used to calculatethe growth and adjust the traffic as described above in relation tosteps S616 and S618. Similarly, the calculated values can be stored ingraphs Q and P shown in FIGS. 6c and 6d and subsequently processed asdescribed above.

Dead Link Detection Mechanism

FIGS. 8a and 8b illustrate a third mechanism which may be used to steertraffic when a link is down. This is helpful because both thepacket-loss steering logic and the lossless steering logic describedabove rely on the presence of traffic to operate.

As shown in FIG. 8a , the method begins when a packet is received onlink i (step S800). The next step is to determine how much time haselapsed since the last packet has been received on this link which maybe denoted e_(i) and which may be termed a timestamp for each link i.This value is then stored by the collector. It will be appreciated thatthis process is repeated for each link so that there is a set of valuesof the timestamps for all links, i.e.

E={e ₁ ,e ₂ ,e ₃ . . . e _(N)}

The next illustrated step (which may happen simultaneously with orbefore the previous step) is for the collector to look at the “previouslink” field on the aggregation header step S806. This field will tell uson which link the previous packet has been sent. If this field indicatesthat the previous packet was sent on link i, then we know that we shouldsee some traffic on link i. If traffic is not present on link i, it canbe inferred that at least one packet-has been lost. As such the deadlink detection mechanism will steer traffic away from link i.

To determine whether or not there is traffic on link i, the collectorwill look up e_(i) (step S806). This is then compared to a thresholdvalue. If it is smaller than the threshold, there is likely to have beensome recent traffic on link i, and thus it can be concluded that thelink is not dead. On the other hand, if e_(i)≥threshold, the collectorwill start a countdown (step S810) with a duration of max-latency. Thecollector will then determine whether there is traffic on link i beforethis countdown expires (step S812). If traffic is seen, the link is notdead and the process can begin again. If no traffic is received, it canbe concluded that at the very least a packet loss event has taken placeand traffic is steered away from link i (step S814).

The adjusted set of weights may be defined as:

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

where a is a negative adjustment defined by:

${a = {{- 1} \cdot {\min\left( {\frac{C}{N},w_{i}} \right)}}},$

where C and N are as defined above.

This formula guarantees that a negative weight is not applied, andrequires multiple passes of the mechanism to consider a link with arelatively high weight to be dead.

FIG. 8b illustrates a collector receiving a packet a on a given link iat time α from a distributor. The “previous link” field of the linkaggregation header tells us that the previous packet, which we will callpacket x, has been recently sent over link i. Latency may be assumed tohave an upper bound which may be referred to as max-latency (an examplevalue is 40 ms, a worst-case value that is rarely reached). A lowerbound, min-latency, is also added which is considered to be zero(without loss of generality, as a latency must always be positive). Fromthese two bounds, given that we have received packet a at time α, weknow that it must have been sent within the interval A defined by:

A=[α−maxlatency,α−minlatency]=[β,α]

The distributor is configured to only fill in the “previous link” fieldif the previous packet was sent within a recent-thresh threshold. Fromthis, it can be inferred that packet x was sent within the time intervalB defined by:

B=[α−maxlatency−recentthresh,α−minlatency]=[γ,α]

Given that packet x was sent within the interval B, it will be receivedwithin the interval C defined by

C=[α−maxlatency−recentthresh,α−minlatency+maxlatency]=[γ,δ]

where γ and β the start and end times of the threshold on the collectorclock.

The threshold which is used in step S808 may be thus be defined asmax-latency+recent-threshold threshold. As previously mentioned, whendescribing the distributor, by default recent-threshold threshold is 0.5ms. Since max-latency+recent-threshold threshold can be a long time(e.g. 40.5 ms in the example system), the threshold may be replaced by asmaller number, in order to improve the reaction time (e.g. wait 10 msinstead of 40.5 ms). A possible downside is that there may be falsepositives (i.e. thinking that a packet has been lost, when it fact it isjust greatly delayed). It is noted that when considering the threshold,the detected traffic might not be packet x, but some other packet, butfor our purposes this does not matter all that much, the important thingis that the link capacity is not zero.

Dead Link Resurrection Mechanism

In all the arrangements above, an optional dead link resurrectionmechanism may be included wherein the collector may also determinewhether the weight of any given link i has dropped to zero. If thecollector identifies a zero weight, the collector will start a countdownwith duration of having a value termed resurrect-delay. Once thiscountdown reaches zero, the collector will set the weight of thedead-link, w_(i), to the minimum of all the weight's multiplied by afactory γ∈]0,1]. The adjusted set of weights may be defined as:

${{\hat{w}}_{j}(a)} = \left\{ \begin{matrix}{{{w_{j} + a},}} & {i = j} \\{{w_{j} - {a \cdot \frac{w_{j}}{C - w_{i}}}},} & {i \neq j}\end{matrix} \right.$

where a is a negative adjustment defined by:

α=γ·min(W),

where γ is a constant for example 0.25.

FIGS. 9a and 9b schematically illustrate some of the components of thedistributor and the collector. The collector comprises a processor 910which performs the methods described above. The processor 910 may beimplemented in hardware such as a micro-processor, a Field ProgrammableGate Array (FPGA) or Application Specific Integrated Circuit (ASIC). Thecollector also comprises a memory 912 which may comprise volatile andnon-volatile memory. The memory 912 may store, for example, the tabledescribed with reference to FIG. 7b . As will be appreciated, the ordermust be preserved as traffic goes through the aggregated link. That isto say, for any two packets, a and b, sent over the aggregated link. Ifpacket a is sent before packet b, packet a should also arrive beforepacket b. Since links have different latencies, packets may arrive atthe collector out-of-order, as such the use of re-order engine 914 islikely to necessary. There are many mechanisms to achieve this and themethods described above are agnostic as to which one is used. Finally,the collector 910 communicates both with the local distributor and theremote distributor and must thus contain a communications module 916.

The components of the distributor mirror those in the collector andcomprise a processor 920, memory 922 (e.g. for storing the set ofper-sequence numbers and global sequence number) and a communicationmodule 926 for communicating with the local collector and the remotecollector.

The link aggregation mechanism described above may be applied regardlessof the specific nature of the links, or the exact nature of thesubstrate on which the associated logic is implemented. It may thus beapplicable to the domain of link aggregation on packetized networks,which would include the following scenarios: aggregation over differentwireless protocols (e.g. LTE and Wi-Fi; Wi-Fi______33 and WiGig),aggregation of multiple channels of the same wireless protocol (e.g.multiple Wi-Fi______33 connections), hybrid aggregation between wirelessand wired (e.g. Wi-Fi+WiGig+Ethernet), link aggregation of multiplewired protocols (e.g. DOCSIS+ADSL; multiple ADSL connections; multipleEthernet connections), and aggregation at the transport layer level whenthe exact nature of the underlying links is not known. However, as anexample, the mechanism may be used to aggregate radio links for examplein the point-to-multipoint radio system described in GB2377596 (B), andillustrated in FIG. 9 c.

FIG. 9c shows a system comprising a radio controller 930, one or moreaccess points 932 a, 932 b, and one or more remote terminals 934 a, 934b, 934 c, 934 d per access point. The radio controller 930 and accesspoints 932 a, 932 b may be co-located on a hub-site, whilst the remoteterminals may be distributed across a given area. As an example, two ofthe remote terminals 943 b, 934 c are co-located and inter-connectedthrough a switch 936 to allow the link aggregation described above to beused.

The distributors and collectors described above reside in radiocontroller and remote terminals. Each distributor and collector has aprocessor implemented on FPGAs to implement the methods described above.The link aggregation logic may be present in all remote terminals butdormant until link aggregation is configured. When link aggregation isconfigured on a group of remote terminals, a leader election proceduretakes place, which decides which of the aggregated remote-terminals willtake the ‘main’ role, i.e. the remote-terminal where the collector anddistributor logic will be enabled.

Each channel is defined by a triplet comprising of a bandwidth, amodulation, and a band. The bandwidth can be one of the following: 10MHz, 14 MHz, 20 MHz, 28 MHz, 30 MHz, 40 MHz, 50 MHz or 56 MHz. As forthe modulation, each link might use QPSK, 16-QAM, 64-QAM, 128-QAM,256-QAM or adaptive. Regarding the band, examples include 10.5 GHz, 26GHz, 27 GHz, 28 GHz, 31 GHz and 39 GHz. It will be appreciated that themethod may be applicable to new bandwidths, modulations and bands.

At least some of the example embodiments described herein may beconstructed, partially or wholly, using dedicated special-purposehardware. Terms such as ‘component’, ‘module’ or ‘unit’ used herein mayinclude, but are not limited to, a hardware device, such as circuitry inthe form of discrete or integrated components, a Field Programmable GateArray (FPGA) or Application Specific Integrated Circuit (ASIC), whichperforms certain tasks or provides the associated functionality. In someembodiments, the described elements may be configured to reside on atangible, persistent, addressable storage medium and may be configuredto execute on one or more processors. These functional elements may insome embodiments include, by way of example, components, such assoftware components, object-oriented software components, classcomponents and task components, processes, functions, attributes,procedures, subroutines, segments of program code, drivers, firmware,microcode, circuitry, data, databases, data structures, tables, arrays,and variables. Although the example embodiments have been described withreference to the components, modules and units discussed herein, suchfunctional elements may be combined into fewer elements or separatedinto additional elements. Various combinations of optional features havebeen described herein, and it will be appreciated that describedfeatures may be combined in any suitable combination. In particular, thefeatures of any one example embodiment may be combined with features ofany other embodiment, as appropriate, except where such combinations aremutually exclusive. Throughout this specification, the term “comprising”or “comprises” means including the component(s) specified but not to theexclusion of the presence of others.

Attention is directed to all papers and documents which are filedconcurrently with or previous to this specification in connection withthis application and which are open to public inspection with thisspecification, and the contents of all such papers and documents areincorporated herein by reference.

All of the features disclosed in this specification (including anyaccompanying claims, abstract and drawings), and/or all of the steps ofany method or process so disclosed, may be combined in any combination,except combinations where at least some of such features and/or stepsare mutually exclusive.

Each feature disclosed in this specification (including any accompanyingclaims, abstract and drawings) may be replaced by alternative featuresserving the same, equivalent or similar purpose, unless expressly statedotherwise. Thus, unless expressly stated otherwise, each featuredisclosed is one example only of a generic series of equivalent orsimilar features.

The invention is not restricted to the details of the foregoingembodiment(s). The invention extends to any novel one, or any novelcombination, of the features disclosed in this specification (includingany accompanying claims, abstract and drawings), or to any novel one, orany novel combination, of the steps of any method or process sodisclosed.

1. A method of distributing data packets through a network comprising aplurality of nodes and a plurality of links connecting each pair ofnodes, the method comprising: receiving at least one data packet at afirst node from a second node, wherein the first node is connected tothe second node via a first plurality of links, determining a currentset of weights which are applied by the second node to distribute datapackets across the first plurality of links, wherein the current set ofweights comprises a current weight for each link in the first pluralityof links and wherein the current set of weights are read from a headerattached to the at least one data packet; analysing the at least onedata packet which is received at the first node from the second node todetermine if the current set of weights are to be adjusted; and when itis determined that the current set of weights is to be adjusted,generating an adjusted set of weights by determining an adjustmentfactor to be applied to the current weight for a selected link in thefirst plurality of links; and applying the adjustment factor to thecurrent weight for the selected link and at least one other currentweight in the current set of weights.
 2. The method of claim 1, whereinanalysing the at least one data packet comprising analysing usinglossless steering logic.
 3. The method of claim 2, wherein analysingusing lossless steering logic comprises using a remote and a localtimestamp for each of two data packets received on a single link tocalculate a latency difference value; wherein the remote timestamprepresents the time at which each data packet was sent, the localtimestamp represents the time at which each data packet was received andthe latency difference value is representative of the latency on thesingle link.
 4. The method of claim 2, wherein analysing the at leastone data packet comprises: determining which link a first data packetwas received on; obtaining a first timestamp for the first data packet,the first timestamp indicating the time at which the data packet wassent from the second node; obtaining a second timestamp for the firstdata packet which indicates the time at which the first data packet wasreceived at the first node; determining when a second data packet isreceived on the same link as the first data packet; obtaining a thirdtimestamp for the second data packet, the third timestamp indicating thetime at which the second data packet was sent from the second node;obtaining a fourth timestamp for the second data packet which indicatesthe time at which the second data packet was received at the first node;and calculating, using the first, second, third and fourth timestamps, alatency difference value which is representative of the latency on thelink on which the first and second data packet was received.
 5. Themethod of claim 4, wherein calculating the latency difference valuecomprises: calculating a first latency value by subtracting the firsttimestamp from the second timestamp; calculating a second latency valueby subtracting the third timestamp from the fourth timestamp; andcalculating the latency difference value by subtracting the firstlatency value from the second latency value.
 6. The method of claim 5,comprising storing a set of latency values comprising the most recentlycalculated latency value for each link.
 7. The method of claim 3,comprising storing a set of latency difference values comprising themost recently calculated latency difference value for each link.
 8. Themethod of claim 3, wherein determining that the current set of weightsare to be adjusted, comprises comparing the latency difference value toa latency growth threshold and when the latency difference value isgreater than the latency growth threshold, applying a latency growthpenalty factor as the adjustment factor.
 9. The method of claim 2,wherein analysing using lossless steering logic comprises calculating adiscrepancy growth value between a first pair of data packets receivedwithin a threshold time on a pair of links and a second pair of datapackets received on the same pair of links within the threshold time,wherein the discrepancy growth value is representative of the latency onthe links on which the first and second pairs of data packets werereceived.
 10. The method of claim 9, wherein calculating the discrepancygrowth value comprises: calculating a first global sequence discrepancyvalue for the first pair of data packets; and calculating a secondglobal sequence discrepancy value for the second pair of data packets;and calculating the discrepancy growth value by subtracting the firstglobal sequence discrepancy value from the second global sequencediscrepancy value.
 11. The method of claim 10, wherein analysing the atleast one data packet comprises: obtaining a first global sequencenumber for a first data packet in the first pair of data packets;obtaining a second global sequence number for a second data packet inthe first pair of data packets; obtaining a third global sequence numberfor a first data packet in the second pair of data packets; obtaining afourth global sequence number for a second data packet in the secondpair of data packets; calculating, using the first, second, third andfourth global sequence numbers, a discrepancy growth value which isrepresentative of the latency on the links on which the first and secondpairs of data packet were received.
 12. The method of claim 11, whereinthe first global sequence discrepancy value is calculated by subtractingthe first global sequence number from the second global sequence number;and the second global sequence discrepancy value is calculated bysubtracting the third global sequence number from the fourth globalsequence number.
 13. The method of claim 12, further comprising:obtaining the first and second global sequence numbers in response todetermining that the first pair of packets has been received within thethreshold time by determining that a difference between times of receiptfor both the data packets in the first pair of packets is lower than thethreshold time and obtaining the third and fourth global sequencenumbers in response to determining that the second pair of packets hasbeen received within the threshold time by determining that a differencebetween times of receipt for both the data packets in the second pair ofpackets is lower than the threshold time.
 14. The method of claim 11,wherein the first global sequence discrepancy value is calculated bysubtracting the time of receipt of the second data packet from the timeof receipt of the first data packet; and the second global sequencediscrepancy value is calculated by subtracting the time of receipt ofthe second data packet from the time of receipt of the first datapacket.
 15. The method of claim 14, further comprising: obtaining thefirst and second global sequence numbers is in response to determiningthat the second data packet in the first pair of packets was receivedwith a flag indicating that the second data packet was sent within thethreshold time of the first data packet in the first pair of packets andobtaining the third and fourth global sequence numbers is in response todetermining that the second data packet in the second pair of packetshas been received with a flag indicating that the second data packet wassent within the threshold time of the first data packet in the secondpair of packets.
 16. The method of claim 15, wherein calculating, usingthe first, second, third and fourth global sequence numbers, adiscrepancy growth value comprises using the first, second, third andfourth global sequence numbers to identify the first and second pairs ofdata packets. 17-21. (canceled)
 22. The method of claim 1, whereinanalysing the at least one data packet comprises: determining when alink is not functioning properly within the network; and when it isdetermined that a link is not functioning, generating an adjusted set ofweights to adjust the weight of the non functioning link by theadjustment factor.
 23. The method of claim 22, comprising determining alink is not functioning by: determining that the time which has elapsedbetween receipt of a pair of packets on the same link is higher than athreshold; in response to this determining, monitoring for receipt of apacket on the same link within a countdown; and when no packet isreceived within the countdown, determining that the link is notfunctioning properly.
 24. The method of claim 22, comprising determininga link is not functioning by: determining that a weight within the setof weights is zero; in response to this determining, starting acountdown; and once the countdown reaches zero, increasing the weight ofthe zero weighted link in proportion to the lowest weight in the set ofweights.
 25. (canceled)
 26. The method of claim 1, wherein applying theadjustment factor to the current weight comprises one of: adding theadjustment factor to the current weight for the selected link toincrease the amount of traffic which is distributed across the selectedlink or subtracting the adjustment factor from the current weight forthe selected link to decrease the amount of traffic which is distributedacross the selected link.
 27. The method of claim 26, wherein theadjustment factor is applied to all the other weights in the current setof weights so that the adjusted weight is adjusted in proportion to itscurrent value.
 28. The method of claim 26, wherein the adjustment factoris applied to only one other weight in the current set of weights andthe remaining weights in the adjusted set of weights have the same valueas the current set of weights.
 29. A collector in a first node in anetwork comprising a plurality of nodes, wherein the collector isconfigured to carry out the steps of claim
 1. 30. A distributor in asecond node in a network comprising a plurality of nodes, thedistributor comprising a processor which is configured to apply acurrent set of weights when sending at least one data packet to thecollector of claim 29; receive an adjusted set of weights from thecollector; and apply the adjusted set of weights when sending subsequentdata packets to the collector.
 31. The distributor of claim 30, whereinthe processor is further configured to add a header to a data packetbefore sending the data packet, wherein the header comprises a pluralityof header values including at least one of a global sequence number, aset of per-link sequence numbers, a previous link field and a timestamp.32. The distributor of claim 30, wherein the processor is furtherconfigured to reset each of the header values in a reset phase andsubsequently update each of the header values when a data packet issent.